- elimination of quantifiers
- мат.элиминация кванторов
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Elimination theory — In commutative algebra and algebraic geometry, elimination theory is the classical name for algorithmic approaches to eliminating between polynomials of several variables.The linear case would now routinely be handled by Gaussian elimination,… … Wikipedia
Quantifier elimination — is a technique in mathematical logic, model theory, and theoretical computer science.We say that a given theory has quantifier elimination if for every sentence with quantification there exists an equivalent (modulo the theory) sentence without… … Wikipedia
Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… … Wikipedia
Real closed field — In mathematics, a real closed field is a field F in which any of the following equivalent conditions are true:#There is a total order on F making it an ordered field such that, in this ordering, every positive element of F is a square in F and… … Wikipedia
Model complete theory — In model theory, a first order theory is called model complete if every embedding of models is an elementary embedding. Equivalently, every first order formula is equivalent to a universal formula. This notion was introduced by Abraham Robinson.… … Wikipedia
Structure (mathematical logic) — In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations which are defined on it. Universal algebra studies structures that generalize the algebraic structures such as… … Wikipedia
Claude Chevalley — Y.Akizuki, C.Chevalley and A.Kobori Born February 11, 1909 … Wikipedia
Weakly o-minimal structure — Weakly O Minimal Definition = A linearly ordered structure, m, with language L including anordering relation … Wikipedia
Semialgebraic set — In mathematics, a semialgebraic set is a subset S of real n dimensional space defined by a finite sequence of polynomial equations and inequalities; or any finite union of such sets. Such sets are studied as an extension of real algebraic… … Wikipedia
Natural deduction — In logic and proof theory, natural deduction is a kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the natural way of reasoning. This contrasts with the axiomatic systems which instead use… … Wikipedia
Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… … Wikipedia